- hard mathematical problem
- трудно решаемая математическая задача, математически трудная задача
Англо-русский словарь по компьютерной безопасности. Академик.ру. 2011.
hard mathematical problem
Смотреть что такое "hard mathematical problem" в других словарях:
Mathematical anxiety — is anxiety about one s ability to do mathematics independent of skill. Contents 1 Math anxiety 2 Performance anxiety 3 Anxiety Rating Scale 4 Math and c … Wikipedia
Mathematical and theoretical biology — is an interdisciplinary scientific research field with a range of applications in biology, medicine and biotechnology.[1] The field may be referred to as mathematical biology or biomathematics to stress the mathematical side, or as theoretical… … Wikipedia
Mathematical analysis — Mathematical analysis, which mathematicians refer to simply as analysis, has its beginnings in the rigorous formulation of infinitesimal calculus. It is a branch of pure mathematics that includes the theories of differentiation, integration and… … Wikipedia
Hard disk drive — Hard drive redirects here. For other uses, see Hard drive (disambiguation). Hard disk drive Mechanical interior of a modern hard disk drive Date invented 24 December 1954 [1] … Wikipedia
Mathematical economics — Economics … Wikipedia
Problem of universals — The problem of universals is an ancient problem in metaphysics about whether universals exist. Universals are general or abstract qualities, characteristics, properties, kinds or relations, such as being male/female, solid/liquid/gas or a certain … Wikipedia
Mathematical psychology — Psychology … Wikipedia
Mathematical descriptions of the electromagnetic field — There are various mathematical descriptions of the electromagnetic field that are used in the study of electromagnetism, one of the four fundamental forces of nature. In this article four approaches are discussed. Contents 1 Vector field approach … Wikipedia
Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… … Wikipedia
Knapsack problem — BKP redirects here. For other uses, see BKP (disambiguation). Example of a one dimensional (constraint) knapsack problem: which boxes should be chosen to maximize the amount of money while still keeping the overall weight under or equal to… … Wikipedia
Diffie–Hellman problem — Cryptography portal The Diffie–Hellman problem (DHP) is a mathematical problem first proposed by Whitfield Diffie and Martin Hellman in the context of cryptography. The motivation for this problem is that many security systems use mathematical… … Wikipedia
